The asymptotic existence of orthogonal designs

نویسندگان

  • Ebrahim Ghaderpour
  • Hadi Kharaghani
چکیده

Given any -tuple ( s1, s2, . . . , s ) of positive integers, there is an integer N = N ( s1, s2, . . . , s ) such that an orthogonal design of order 2 ( s1 + s2 + · · ·+ s ) and type ( 2s1, 2 s2, . . . , 2 s ) exists, for each n ≥ N . This complements a result of Eades et al. which in turn implies that if the positive integers s1, s2, . . . , s are all highly divisible by 2, then there is a full orthogonal design of type ( s1, s2, . . . , s ) .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Signed group orthogonal designs and their applications

Craigen introduced and studied signed group Hadamard matrices extensively in [1, 2]. Livinskyi [13], following Craigen’s lead, studied and provided a better estimate for the asymptotic existence of signed group Hadamard matrices and consequently improved the asymptotic existence of Hadamard matrices. In this paper, we introduce and study signed group orthogonal designs. The main results include...

متن کامل

New 2-designs from strong difference families

Strong difference families are an interesting class of discrete structures which can be used to derive relative difference families. Relative difference families are closely related to 2-designs, and have applications in constructions for many significant codes, such as optical orthogonal codes and optical orthogonal signature pattern codes. In this paper, with a careful use of cyclotomic condi...

متن کامل

Strongly amicable orthogonal designs and amicable Hadamard matrices

Amicable orthogonal designs have renewed interest because of their use in mobile communications. We show the existence of strong amicable orthogonal designs, AOD(n : 1, n − 1; 1, n − 1), for n = p + 1, p ≡ 3 (mod 4) a prime and for n = 2, n a non-negative integer in a form more suitable for communications. Unfortunately the existence of amicable Hadamard matrices is not enough to demonstrate th...

متن کامل

Asymptotic existence theorems for frames and group divisible designs

In this paper, we establish an asymptotic existence theorem for group divisible designs of type mn with block sizes in any given set K of integers greater than 1. As consequences, we will prove an asymptotic existence theorem for frames and derive a partial asymptotic existence theorem for resolvable group divisible designs. © 2006 Elsevier Inc. All rights reserved.

متن کامل

Some Optimal Codes From Designs

The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 58  شماره 

صفحات  -

تاریخ انتشار 2014